Interpolation of Linear Operators

نویسنده

  • ELIAS M. STEIN
چکیده

The aim of this paper is to prove a generalization of a well-known convexity theorem of M. Riesz [8]. The Riesz theorem was originally deduced by "real-variable" techniques. Later, Thorin [10], Tamarkin and Zygmund [9], and Thorin [ll] introduced convexity properties of analytic functions in their study of Riesz's theorem. These ideas were put in especially suggestive form by A. P. Calderon and A. Zygmund [3]. It is the last mentioned approach to the Riesz theorem which is our starting point. In the interpolation theorem we shall prove, we vary not only over the Lebesgue spaces in question, but we also vary the linear operators in question. An exact statement will be found in Theorem 1. Part II contains the first application of the interpolation theorem. We shall consider "Bochner-Riesz" summability of multiple Fourier series and Fourier integrals; we prove that we have Lp norm convergence (for Kp< 00) for the Bochner-Riesz means below the critical index. These results are contained in Theorems 3 and 4. A second application will be found in Part III. We shall show that a theorem of Pitt for Fourier Series may be proved for all uniformly bounded orthonormal systems. The fact that Pitt's theorem may hold in general circumstances was suggested by Professor A. Zygmund to the author. The last result is interesting when reapplied to the case of Fourier series via the familiar device of rearrangements. The result contains well-known inequalities of F. Riesz and R. E. A. C. Paley, as well as an inequality recently proved by I. I. Hirschman(2).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximation of Univariate Set-Valued Functions- an Overview

The paper is an updated survey of our work on the approximation of univariate setvalued functions by samples-based linear approximation operators, beyond the results reported in our previous overview. Our approach is to adapt operators for real-valued functions to set-valued functions, by replacing operations between numbers by operations between sets. For set-valued functions with compact conv...

متن کامل

Camera Keyframing Using Linear Interpolation of Matrices

Alexa’s method for linearly interpolating matrices is well-suited for application to camera matrices. This paper discusses implementation issues that arise when applying this method to camera interpolation. We show how to include the perspective matrix, even though Alexa’s operators cannot be applied directly to it. We discuss cases where Alexa’s operators fail to converge and show how to work ...

متن کامل

PWL Approximation of Non-linear Functions for the Implementation of Neuro-Fuzzy Systems

A piecewise linear (PWL) function approximation scheme is described by a lattice algebra of modified operators that allows for the interpolation of PWL function vertexes. A new recursive method called Centred Recursive Interpolation (CRI) based on such modified operators is analysed for successive function smoothing and more accurate approximation. This approximation method, simple but accurate...

متن کامل

Statistically Optimal Multigrid Algorithms for the Anharmonic Crystal Model

Two types of multigrid algorithms for the one dimensional anhar-monic crystal model are presented. The rst type applies linear interpolation operators and the second type applies nonlinear interpolation operators with approximate Hamiltonians on coarse grids. For both algorithms, the question of eliminating the \volume" complexity factor is examined, i.e., the feasibility of the algorithm to re...

متن کامل

Generalization of the interaction between the Haar approximation and polynomial operators to higher order methods

In applications it is useful to compute the local average of a function f(u) of an input u from empirical statistics on u. A very simple relation exists when the local averages are given by a Haar approximation. The question is to know if it holds for higher order approximation methods. To do so, it is necessary to use approximate product operators defined over linear approximation spaces. Thes...

متن کامل

A degenerate kernel method for eigenvalue problems of non-compact operators with applications in electromagnetism and continuum-of-alleles models

We consider the eigenvalue problem of certain kind of non-compact linear operators given as the sum of a multiplication and a kernel operator. A degenerate kernel method with piecewise linear interpolation with respect to the second variable is used to approximate eigenvalues. It is shown that the error is of order O(h). A bound for the condition number of this method is obtained. By a numerica...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010